A Generalized Global Optimization Algorithm for Dual Response Systems
نویسندگان
چکیده
During exploration of an industrial process, the engineer/experimenter must take into account both the mean and variance of the system in order to seek the appropriate parameter settings for better production outputs. This situation leads to the problem of determining optimal operating conditions for one response function while keeping a desirable target on the other response, the so-called dual response (DR) system. The purpose of this paper is to present an ANSI FORTRAN implementation of a comprehensive algorithm for the global (or near-global) optimization of DR systems within a radial region of experimentation. The algorithm, DR2, is a new computational procedure that guarantees a global optimal solution for nondegenerate problems and returns a near-global one for degenerate problems. Three degenerate problems published in the response surface methodology literature are provided which compare the performance of DR2 with that of other algorithms. In one of these examples, the Taguchi’s “target is best” case is used to illustrate an important application of DR2. In the final parts of the paper, DR2 is tested against an implementation of sequential quadratic programming (SQP)-MINOS. Computational results based on large simulations show that DR2 is more effective at locating optimal operating conditions (near global optima) even if the DR system is degenerate.
منابع مشابه
A generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملIIR System Identification Using Improved Harmony Search Algorithm with Chaos
Due to the fact that the error surface of adaptive infinite impulse response (IIR) systems is generally nonlinear and multimodal, the conventional derivative based techniques fail when used in adaptive identification of such systems. In this case, global optimization techniques are required in order to avoid the local minima. Harmony search (HS), a musical inspired metaheuristic, is a recently ...
متن کاملControl of nonlinear systems using a hybrid APSO-BFO algorithm: An optimum design of PID controller
This paper proposes a novel hybrid algorithm namely APSO-BFO which combines merits of Bacterial Foraging Optimization (BFO) algorithm and Adaptive Particle Swarm Optimization (APSO) algorithm to determine the optimal PID parameters for control of nonlinear systems. To balance between exploration and exploitation, the proposed hybrid algorithm accomplishes global search over the whole search spa...
متن کاملControl of nonlinear systems using a hybrid APSO-BFO algorithm: An optimum design of PID controller
This paper proposes a novel hybrid algorithm namely APSO-BFO which combines merits of Bacterial Foraging Optimization (BFO) algorithm and Adaptive Particle Swarm Optimization (APSO) algorithm to determine the optimal PID parameters for control of nonlinear systems. To balance between exploration and exploitation, the proposed hybrid algorithm accomplishes global search over the whole search spa...
متن کاملParticle Swarm Optimization for Hydraulic Analysis of Water Distribution Systems
The analysis of flow in water-distribution networks with several pumps by the Content Model may be turned into a non-convex optimization uncertain problem with multiple solutions. Newton-based methods such as GGA are not able to capture a global optimum in these situations. On the other hand, evolutionary methods designed to use the population of individuals may find a global solution even for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000